Distances of centroid sets in a graph-based construction for information security applications

Title: Distances of centroid sets in a graph-based construction for information security applications
Creator: Abawajy, J.; Kelarev, A. V.; Miller, M.; Ryan, J.
Relation: Mathematics in Computer Science Vol. 9, Issue 2, p. 127-137
Publisher Link: http://dx.doi.org/10.1007/s11786-015-0217-1
Publisher: Springer
Resource Type: journal article
Date: 2015
Description: The aim of this paper is to prove that, for every balanced digraph, in every incidence semiring over a semifield, each centroid set J of the largest distance also has the largest weight, and the distance of J is equal to its weight. This result is surprising and unexpected, because examples show that distances of arbitrary centroid sets in incidence semirings may be strictly less than their weights. The investigation of the distances of centroid sets in incidence semirings of digraphs has been motivated by the information security applications of centroid sets.
Subject: centroid sets; directed graphs; distances
Identifier: http://hdl.handle.net/1959.13/1339816
Identifier: uon:28348
Identifier: ISSN:1661-8270
Rights: The final publication is available at Springer via http://dx.doi.org/10.1007/s11786-015-0217-1
Language: eng
Full Text
Reviewed

		Thumbnail	File	Description	Size	Format
View Details Download			ATTACHMENT02	Author final version	377 KB	Adobe Acrobat PDF	View Details Download